Geometric characterization of capacity-constraint function
نویسندگان
چکیده
In the first case s* remains equal to 2, in the next three cases s* is equal to 1, and in the last three cases s* becomes 0. MO= 3 1 0 MI= 0 1 3 .
منابع مشابه
Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کاملA Geometric Analysis of the AWGN channel with a $(\sigma, \rho)$-Power Constraint
In this paper, we consider the AWGN channel with a power constraint called the (σ, ρ)-power constraint, which is motivated by energy harvesting communication systems. Given a codeword, the constraint imposes a limit of σ+kρ on the total power of any k ≥ 1 consecutive transmitted symbols. Such a channel has infinite memory and evaluating its exact capacity is a difficult task. Consequently, we e...
متن کاملCharacterizations Using Entropies of Records in a Geometric Random Record Model
Suppose that a geometrically distributed number of observations are available from an absolutely continuous distribution function $F$, within this set of observations denote the random number of records by $M$. This is called geometric random record model. In this paper, characterizations of $F$ are provided in terms of the subsequences entropies of records conditional on events ${M geq n}$ or ...
متن کاملAlgebraic Geometry and Group Theory in Geometric Constraint Satisfaction
The determination of a set of geometric entities that satisfy a series of geometric relations (constraints) constitutes the Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF) problem. This problem appears in diierent forms in Assembly Planning, Constraint Driven Design, Computer Vision, etc. Its solution is related to the existence of roots to systems of polynomial equations. Previ...
متن کاملOn the State Constrained Minimal Time Function
A standard class of finite dimensional control systems is considered, along with a state constraint set S and a target set Σ ⊂ S. Under certain geometric assumptions on S and a required S-constrained small time controllability property, a proximal Hamilton-Jacobi characterization of the S-constrained minimal time function to target Σ is obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 1989